Matching of Complex Scenes Based on Constrained Clustering
نویسندگان
چکیده
This paper presents an algorithm and a software application for matching complex scenes in consumer image collections. By applying appropriate constraints to detected keypoint matches between a target and reference image, complex scenes from users’ collections can be matched with very good precision. Experimental results confirm the effectiveness of this approach. The method can be further enhanced to retrieve similar scenes from different users by incorporating event information.
منابع مشابه
Recognizing Indoor Images with Unsupervised Segmentation and Graph Matching
In this paper we address the problem of recognizing scenes by performing unsupervised segmentation followed by matching the resulting adjacency region graph. Our segmentation method is an adaptive extension of the Asymetric Clustering Model, a distributional clustering method based on the EM algorithm, whereas our matching proposal consists of embodying the Graduated Assignement cost function i...
متن کاملRepeated Record Ordering for Constrained Size Clustering
One of the main techniques used in data mining is data clustering, which has many applications in computer science, biology, and social sciences. Constrained clustering is a type of clustering in which side information provided by the user is incorporated into current clustering algorithms. One of the well researched constrained clustering algorithms is called microaggregation. In a microaggreg...
متن کاملCentralized Clustering Method To Increase Accuracy In Ontology Matching Systems
Ontology is the main infrastructure of the Semantic Web which provides facilities for integration, searching and sharing of information on the web. Development of ontologies as the basis of semantic web and their heterogeneities have led to the existence of ontology matching. By emerging large-scale ontologies in real domain, the ontology matching systems faced with some problem like memory con...
متن کاملUsing Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands
Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands Abstract In this paper, the capacitated location routing problem with fuzzy demands (CLRP_FD) is considered. In CLRP_FD, facility location problem (FLP) and vehicle routing problem (VRP) are observed simultaneously. Indeed the vehicles and the depots have a predefined capacity to serve the customerst...
متن کاملPerceptual Organization for Text Extraction in Natural Scenes
The automated understanding of textual information in natural scenes is an important problem to solve for the Computer Vision and Document Analysis community. In this Thesis we approach the problem of text detection and extraction from an anthropocentric point of view, arguing that the Gestalt grouping laws, as a primary process in the human vision system, is something inherent in the complex c...
متن کامل